Duality and Universal Models for the Meet-Implication Fragment of IPC
نویسندگان
چکیده
In this paper we investigate the fragment of intuitionistic logic which only uses conjunction (meet) and implication, using finite duality for distributive lattices and universal models. We give a description of the finitely generated universal models of this fragment and give a complete characterization of the up-sets of Kripke models of intuitionistic logic which can be defined by meet-implication-formulas. We use these results to derive a new version of subframe formulas for intuitionistic logic and to show that the uniform interpolants of meet-implication-formulas are not necessarily uniform interpolants in the full intuitionistic logic.
منابع مشابه
Universal Models for the Positive Fragment of Intuitionistic Logic
We study the n-universal model of the [∨,∧,→]-fragment of the intuitionistic propositional calculus IPC. We denote it by U(n) and show that it is isomorphic to a generated submodel of the n-universal model of IPC, which is denoted by U(n). We show that this close resemblance makes U(n) mirror many properties of U(n). Using U(n), we give an alternative proof of Jankov’s theorem stating that the ...
متن کاملUniversal Triple I Method for Fuzzy Reasoning and Fuzzy Controller
As a generalization of the triple I method, the universal triple Imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. The universal triple I principle is putforward, which improves the previous triple I principle. Then,unified form of universal triple I method is established based onthe (0,1)-implication or R-implication. Moreover, the reversibilityproperty o...
متن کاملComplexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic
The goal of this paper is to study the complexity of the set of admissible rules of the implication-negation fragment of intuitionistic logic IPC. Surprisingly perhaps, although this set strictly contains the set of derivable rules (the fragment is not structurally complete), it is also PSPACE-complete. This differs from the situation in the full logic IPC where the admissible rules form a co-N...
متن کاملThe Universal Model for the Negation-free Fragment of IPC
We identify the universal n-model of the negation-free fragment of the intuitionistic propositional calculus IPC. We denote it by U(n) and show that it is isomorphic to a generated submodel of the universal n-model of IPC, which is denoted by U(n). We show that this close resemblance makes U(n) mirror many properties of U(n). Finally, using U(n), we give an alternative proof of Jankov’s Theorem...
متن کاملAdmissible rules in the implication-negation fragment of intuitionistic logic
Uniform infinite bases are defined for the single-conclusion and multiple-conclusion admissible rules of the implication–negation fragments of intuitionistic logic IPC and its consistent axiomatic extensions (intermediate logics). A Kripke semantics characterization is given for the (hereditarily) structurally complete implication–negation fragments of intermediate logics, and it is shown that ...
متن کامل